Divisible Codes - A Survey
نویسنده
چکیده
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over nite elds. Then it presents recent results on bounds and applications to optimal codes.
منابع مشابه
Divisibility of Codes Meeting the Griesmer Bound
The brackets of ``[n, k, d]'' signal that C is linear, and n is the length, k the dimension, and d the minimum weight of C. The bound was proved by Griesmer in 1960 for q=2 and generalized by Solomon and Stiffler in 1965. Over the years, much effort has gone into constructing codes meeting the bound or showing, for selected parameter values, that they do not exist. This effort is part of the mo...
متن کاملAutomorphisms of Constant Weight Codes and of Divisible Designs
We show that the automorphism group of a divisible design D is isomorhic to a subgroup H of index 1 or 2 in the automorphism group Aut C(D) of the associated constant weight code. Only in very special cases, H is not the full automorphism group.
متن کاملDivisible designs with dual translation group
Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism group enables us to characterize its associated divisible design as being isomorphic to a substructure of a finite affine space. AMS Classification: 05B05, 05B30, 20B25, 51N10
متن کاملAn improvement of the Johnson bound for subspace codes
Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective qr-divisible codes.
متن کاملNew Digital Fingerprint Code Construction Scheme Using Group-Divisible Design
Combinatorial designs have been used to construct digital fingerprint codes. Here, a new constructive algorithm for an anticollusion fingerprint code based on group-divisible designs is presented. These codes are easy to construct and available for a large number of individuals, which is important from a business point of view. Group-divisible designs have not been used previously as a tool for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001